Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
851	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-10-04 12:29:59 Approximation algorithms Complexity classes Polynomial-time approximation scheme Optimization problem APX Parameterized complexity Bin packing problem PTAS reduction Theoretical computer science Applied mathematics Computational complexity theory
852	Adaptive Informative Path Planning in Metric Spaces Zhan Wei Lim, David Hsu, and Wee Sun Lee National University of Singapore, Singapore, Singapore Abstract. In contrast to classic robot motion planning, informati Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2014-07-16 20:39:51 Operations research Approximation algorithm Computational complexity theory Travelling salesman problem Algorithm XTR Theoretical computer science Mathematics Applied mathematics
853	Journal of Artificial Intelligence Research637 Submitted 02/14; publishedProbabilistic Inference in Credal Networks: New Complexity Results Add to Reading List Source URL: jair.org Language: English - Date: 2014-07-28 01:14:54 Probability theory Bayesian inference Credal set Statistical models Bayesian network Hidden Markov model Naive Bayes classifier Joint probability distribution Independence Statistics Bayesian statistics Probability and statistics
854	Small, Stupid, and Scalable: Secure Computing with Faerieplay∗ Alexander Iliev Sean W. Smith Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2010-11-08 12:53:14 Secure multi-party computation Circuit complexity Circuit Lookup table Boolean circuit Advantage Randomized algorithm Blinding Field-programmable gate array Theoretical computer science Applied mathematics Computational complexity theory
855	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
856	Meeting the Deadline: On the Complexity of Fault-Tolerant Continuous Gossip ∗ † Chryssis Georgiou Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:09 Analysis of algorithms Human communication Complexity classes Gossip protocol Network architecture Randomized algorithm Consensus Time complexity Distributed computing Theoretical computer science Computational complexity theory Applied mathematics
857	Distributed Computing over Communication Networks: Locality Lower Bounds Stefan Schmid @ T-Labs, 2011 Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:49 Graph coloring NP-complete problems Graph theory Algorithm Distributed computing Time complexity Edge coloring Theoretical computer science Mathematics Applied mathematics
858	From Navigation to Robotic-Assisted Surgery: Combined Planning in Discrete and Continuous Spaces Erion Plaku This work aims to deal formally and efficiently with the complexity of planning that arises at the intersection Add to Reading List Source URL: faculty.cua.edu Language: English - Date: 2014-10-28 09:35:43 Robot control Planning Domain Definition Language Control theory Robotics Obstacle avoidance Robot Applied mathematics Simulation Artificial intelligence Motion planning Theoretical computer science Automated planning and scheduling
859	Originally published in Proc. 3rd WALCOM, LNCS. Springer, 2009. To appear. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane Michael Dom1 and Michael R. Fellows2,⋆ and Frances A. Rosamond2,⋆ 1 Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2008-12-19 10:15:00 Applied mathematics Computational complexity theory Quadrilaterals Rectangle Matrix Dominating set Vertex cover Parameterized complexity Clique Theoretical computer science NP-complete problems Mathematics
860	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics

UPDATE